Zero testing of p-adic and modular polynomials
نویسندگان
چکیده
منابع مشابه
Zero testing of p-adic and modular polynomials
We obtain new algorithms for testing whether a given by a black box multivariate polynomial over p-adic elds given by a black box is identical to zero. We also remark on the zero testing of polynomials in residue rings. Our results complement a known results on the zero testing of polynomials over the integers, the rationals, and over nite elds. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملResultants and subresultants of p-adic polynomials
We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are highly unstable on average and we explain, in many cases, how one can stabilize them without sacrifying the complexity. On the way, we completely determine the d...
متن کاملMeasurable Dynamics of Simple p-adic Polynomials
The p-adic numbers have many fascinating properties that are different from those of the real numbers. These properties are a consequence of the fact that the distance in the p-adics is measured using a non-Archimedian absolute value or norm. In this article we study the dynamics of algebraically defined transformations on the p-adics and see that there is a strong connection between the topolo...
متن کاملCharacteristic Polynomials of p-adic Matrices
We analyze the precision of the characteristic polynomial χ(A) of an n × n p-adic matrix A using differential precision methods developed previously. When A is integral with precision O(p), we give a criterion (checkable in time O (̃n)) for χ(A) to have precision exactly O(p). We also give a O (̃n) algorithm for determining the optimal precision when the criterion is not satisfied, and give examp...
متن کاملModular and p-adic Cyclic Codes
This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo pa and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic cyclic code of length 7 with generator polynomial X 3 + ,~X 2 + (L I)X -l, where )~ satisfies ~2 _ k + 2 = 0. This is the 2-adic generalization of both the bina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00133-4